CONNECTED AND DISCONNECTED PLANE SETS AND THE FUNCTIONAL EQUATION f(x)+f(y)=f(x+y)

نویسنده

  • F. B. JONES
چکیده

Cauchy discovered before 1821 that a function satisfying the equation ƒ(*)+ƒ (y) =f(* + y) is either continuous or totally discontinuous. After Hamel showed the existence of a discontinuous function satisfying the equation, many mathematicians have concerned themselves with problems arising from the study of such functions. However the following question seems to have gone unanswered : Since the plane image of such a function (the graph of y =f(x)) must either be connected or be totally disconnected, must the function be continuous if its image is connected? The answer is no. The utility of this answer is at once apparent. For if f(x) is totally discontinuous, its image obviously contains neither a continuum nor (in view of Darboux's work) a bounded connected subset even if the image itself is connected. As a matter of fact, if f(x) is discontinuous but its image is connected, then the image, its complement, or some simple modification thereof, serves to illustrate rather easily many of the strange and non-intuitive properties of connected sets now illustrated by numerous complicated examples scattered through the literature. Thus this class of sets is a useful tool in studying connectedness and disconnectedness. A few illustrations are given, particularly in connection with

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On Partitions of Plane Sets into Simple Closed Curves

We investigate the conjecture that the complement in the euclidean plane E2 of a set F of cardinality less than the continuum c can be partitioned into simple closed curves iff F has a single point. The case in which F is finite was settled in [1] where it was used to prove that, among the compact connected two-manifolds, only the torus and the Klein bottle can be so partitioned. Here we prove ...

متن کامل

Model-Theoretic Characterizations of Arcs and Simple Closed Curves

Two compact Hausdorff spaces are co-elementarily equivalent if they have homeomorphic ultracopowers; equivalently if their Banach spaces of continuous real-valued functions have isometrically isomorphic Banach ultrapowers (or, approximately satisfy the same positive-bounded sentences). We prove here that any locally connected compact metrizable space co-elementarily equivalent with an arc (resp...

متن کامل

Some Remarks on Connected Sets

This note will consist of a few disconnected remarks on connected sets . i. Swingle2 raised the question whether the plane is the sum of c disjoint biconnected sets . The answer as we shall show is affirmative . First we construct a biconnected set A with a dispersion point x such that any two points of A -x can be separated . (The first such set was constructed by Wilder.-' Our construction wi...

متن کامل

On f-factors in claw-free graphs

Let G be a 2-connected claw-free graph such that δ(G) ≥ 5. Then for every function f : V (G) → {1, 2}, where x∈V (G) f(x) is even, G has an f -factor. All graphs considered are assumed to be simple and finite. We refer the reader to [1] for standard graph theoretic terms not defined in this paper. Let G be a graph. The degree dG(u) of a vertex u in G is the number of edges of G incident with u....

متن کامل

The colour theorems of Brooks and Gallai extended

One of the basic results in graph colouring is Brooks' theorem [-4] which asserts that the chromatic number of every connected graph, that is not a complete graph or an odd cycle, does not exceed its maximum degree. As an extension of this result, Gallai [6] characterized the subgraphs of k-colour-critical graphs induced by the set of all vertices of degree k 1. The choosability version of Broo...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2007